/*  untangling.h
 * Copyright (C) 2010, Francisco Claude & Patrick Nicholson, all rights reserved.
 *
 * Francisco Claude & Patrick Nicholson <(fclaude|p3nichol)@cs.uwaterloo.ca>
 *
 *   This program is free software: you can redistribute it and/or modify
 *   it under the terms of the GNU General Public License as published by
 *   the Free Software Foundation, either version 3 of the License, or
 *   (at your option) any later version.
 *
 *   This program is distributed in the hope that it will be useful,
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *   GNU General Public License for more details.
 *
 *   You should have received a copy of the GNU General Public License
 *   along with this program.  If not, see <http://www.gnu.org/licenses/>.
 *
 */

#include<iostream>
#include<fstream>
#include<sstream>
#include<algorithm>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<stack>
#include<cassert>

using namespace std;

#include "point.h"
#include "geometry.h"

#ifndef UNTANGLING_H
#define UNTANGLING_H

/** Untangles two chains assuming that they only have v-tangles */
bool untangle(vector<Point*> & chain1, vector<Point*> & chain2);
/** Untangles the result of supowit's algorithm  */
vector<vector<Point*>*> untangle(vector<vector<Point*>*> chains);
/** Checks if two chains are untangled */
bool checkUntangled(vector<Point*> & chain1, vector<Point*> & chain2);

#endif

